A Generalised Dynamical System, Infinite Time
نویسنده
چکیده
We identify a number of theories of strength that of Π 1 CA0. In particular: (a) the theory that the set of points attracted to the origin in a generalised transfinite dynamical system of any n-dimensional integer torus exists; (b) the theory asserting that for any Z ⊆ ω and n, the halting set H n of infinite time n-register machine with oracle Z exists. Suppose f : N −→ N. We are going to consider transfinite iterations of such f : N −→ N as a generalised dynamical system. If one wishes, one may think of f acting on the points of an n-dimensional lattice torus where we identify∞ with 0. We set this up as follows. Given a point r = (r1, . . . , rn) ∈ N set: r = (r 1, . . . , r 0 n) = (r1, . . . , rn); r = (r 1 , . . . , r α+1 n ) = f((r α 1 , . . . , r α n)); r = (r 1 , . . . , r λ n) = (Liminf ∗ α→λ r α 1 ,Liminf ∗ α→λ r α 2 , . . . ,Liminf ∗ α→λ r α n) where we define Liminfα→λ r α 1 = Liminfα→λ r α 1 if the latter is < ω, and set it to 0 otherwise, thus: r i = Liminfα→λ r α i if the latter is < ω = 0 otherwise. We may ask after the behaviour of points under this dynamic. For example which points ultimately end up at the origin O? As a more amusing example let p = (p0, p1, p2) ∈ (N) be a triple of three points on the n-dimensional lattice. In general they thus form a proper triangle. Then define: Tf = {(p0, p1, p2) ∈ N | ∃α p0 = p1 = p2 }. Tf is thus the set of possible starting triangles, which at some point collapse and become coincident after iteration of their vertices (and remain collapsed of course from some point α0 onwards). ?
منابع مشابه
Dynamical System and Semi-Hereditarily Hypercyclic Property
In this paper we give conditions for a tuple of commutative bounded linear operators which holds in the property of the Hypercyclicity Criterion. We characterize topological transitivity and semi-hereiditarily of a dynamical system given by an n-tuple of operators acting on a separable infinite dimensional Banach space .
متن کاملSolving Linear Semi-Infinite Programming Problems Using Recurrent Neural Networks
Linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints. In this paper, to solve this problem, we combine a discretization method and a neural network method. By a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem. Then, we use...
متن کاملAbstractions of hybrid systems: formal languages to describe dynamical behaviour ⋆
ions of hybrid systems: formal languages to describe dynamical behaviour ⋆ Rebekah Carter, Eva M. Navarro-López School of Computer Science, The University of Manchester Oxford Road, Manchester, M13 9PL, UK (e-mails: [email protected], [email protected]) Abstract: We show how finite-state automata over finite and infinite words can capture key dynamical properties of hybrid systems. Th...
متن کاملLI-YORKE CHAOTIC GENERALIZED SHIFT DYNAMICAL SYSTEMS
In this text we prove that in generalized shift dynamical system $(X^Gamma,sigma_varphi)$ for finite discrete $X$ with at least two elements, infinite countable set $Gamma$ and arbitrary map $varphi:GammatoGamma$, the following statements are equivalent: - the dynamical system $(X^Gamma,sigma_varphi)$ is Li-Yorke chaotic; - the dynamical system $(X^Gamma,sigma_varphi)$ has an scr...
متن کاملBerry phase for a particle in an infinite spherical potential well with moving wall
In this paper we calculate the Berry phase for a wave function of a particle in an infinite spherical potential well with adiabatically varying. In order to do this, we need the solutions of the corresponding Schrödinger equation with a time dependent Hamiltonian. Here, we obtain these solutions for the first time. In addition, we calculate the Berry phase in one dimensional case for an infinit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011